Vague notions, such as ‘generally’, ‘rarely’, ‘often’, ‘almost always’, ‘a meaningful subset of a whole’, ‘most’, etc., occur often in ordinary language and in some branches of science. We introduce modal logical systems, with generalized operators, for the precise treatment of assertions involving some versions of such vague notions. We examine modal logics, constructed in a modular fashion, with generalized operators corresponding to some versions of ‘generally’ and ‘rarely’.

This is the report on the XVI BRAZILIAN LOGIC CONFERENCE (EBL 2011) held in Petrópolis, Rio de Janeiro, Brazil between May 9–13, 2011 published in The Bulletin of Symbolic Logic Volume 18, Number 1, March 2012. -/- The 16th Brazilian Logic Conference (EBL 2011) was held in Petro ́polis, from May 9th to 13th, 2011, at the Laboratório Nacional de Computação o Científica (LNCC). It was the sixteenth in a series of conferences that started in 1977 with the aim of (...) congregating logicians from Brazil and abroad, furthering interest in logic and its applications, stimulating cooperation, and contributing to the development of this branch of science. EBL 2011 included more than one-hundred and fifty participants, all of them belonging to prominent research institutes from Brazil and abroad, especially Latin America. The conference was sponsored by the Academia Brasileira de Ciências (ABC), the As- sociation for Symbolic Logic (ASL), Universidade Estadual de Campinas (UNICAMP), Centre for Logic, Epistemology and the History of Sciences (CLE), Laboratório Nacional de Computação o Científica (LNCC), Pontif ́ıcia Universidade Cato ́lica do Rio de Janeiro (PUC- Rio), Sociedade Brasileira de Lógica (SBL), and Universidade Federal Fluminense (UFF). Funding was provided by Conselho Nacional de Desenvolvimento Cient ́ıfico e Tecnolo ́ gico (CNPq), Fundac ̧a ̃o de Amparo `a Pesquisa do Estado de São Paulo (FAPESP), Fundação Euclides da Cunha (FEC), and Universidade Federal Fluminense (UFF). The members of the Scientific Committee were: Mário Folhadela Benevides (COPPE- UFRJ), Fa ́bio Bertato (CLE-IFCH-UNICAMP), Jean-Yves Béziau (UFRJ), Ricardo Bianconi (USP), Juliana Bueno-Soler (UFABC), Xavier Caicedo (Universidad de Los An- des), Walter Carnielli (CLE-IFCH-UNICAMP), Oswaldo Chateaubriand Filho (PUC-Rio), Marcelo Esteban Coniglio (CLE-IFCH-UNICAMP), Newton da Costa (UFSC, President), Antonio Carlos da Rocha Costa (UFRG), Alexandre Costa-Leite (UnB), I ́tala M. Loffredo D’Ottaviano (CLE-IFCH-UNICAMP), Marcelo Finger (USP), Edward Hermann Haeusler (PUC-Rio), Décio Krause (UFSC), João Marcos (UFRN), Ana Teresa de Castro Martins (UFC), Maria da Paz Nunes de Medeiros (UFRN), Francisco Miraglia (USP), Luiz Car- los Pereira (PUC-Rio and UFRJ), Elaine Pimentel (UFMG), and Samuel Gomes da Silva (UFBA). The members of the Organizing Committee were: Anderson de Araujo (UNICAMP), Walter Carnielli (CLE-IFCH-UNICAMP), Oswaldo Chateaubriand Filho (PUC-Rio, Co- chair), Marcelo Correa (UFF), Renata de Freitas (UFF), Edward Hermann Haeusler (PUC- RJ), Hugo Nobrega (COPPE-UFRJ), Luiz Carlos Pereira (PUC-Rio e IFCS/UFRJ), Leandro Suguitani (UNICAMP), Rafael Testa (UNICAMP), Leonardo Bruno Vana (UFF), and Petrucio Viana (UFF, Co-chair). (shrink)

Review & Reply. Review of Gonçalves, R.T. (tr.) Lucrécio. Sobre a Natureza das Coisas(2021).

We discuss the question of inclusions between positive relational terms and some of its aspects, using the form of a dialogue. Two possible approaches to the problem are emphasized: natural deduction and graph manipulations. Both provide sound and complete calculi for proving the valid inclusions, supporting nice strategies to obtain proofs in normal form, but the latter appears to present several advantages, which are discussed.

In this paper we show that the class of fork squares has a complete orthodox axiomatization in fork arrow logic (FAL). This result may be seen as an orthodox counterpart of Venema's non-orthodox axiomatization for the class of squares in arrow logic. FAL is the modal logic of fork algebras (FAs) just as arrow logic is the modal logic of relation algebras (RAs). FAs extend RAs by a binary fork operator and are axiomatized by adding three equations to RAs equational (...) axiomatization. A proper FA is an algebra of relations where the fork is induced by an injective operation coding pair formation. In contrast to RAs, FAs are representable by proper ones and their equational theory has the expressive power of full first-order logic. A square semantics (the set of arrows is U×U for some set U) for arrow logic was defined by Y. Venema. Due to the negative results about the finite axiomatizability of representable RAs, Venema provided a non-orthodox finite axiomatization for arrow logic by adding a new rule governing the applications of a difference operator. We address here the question of extending the type of relational structures to define orthodox axiomatizations for the class of squares. Given the connections between this problem and the finitization problem addressed by I. Németi, we suspect that this cannot be done by using only logical operations. The modal version of the FA equations provides an orthodox axiomatization for FAL which is complete in view of the representability of FAs. Here we review this result and carry it further to prove that this orthodox axiomatization for FAL also axiomatizes the class of fork squares. (shrink)

In this work, formulas are inclusions \ and non-inclusions \ between Boolean terms \ and \. We present a set of rules through which one can transform a term t in a diagram \ and, consequently, each inclusion \ ) in an inclusion \ ) between diagrams. Also, by applying the rules just to the diagrams we are able to solve the problem of verifying if a formula \ is consequence of a, possibly empty, set \ of formulas taken as (...) hypotheses. Our system has a diagrammatic language based on Venn diagrams that are read as sets, and not as statements about sets, as usual. We present syntax and semantics of the diagrammatic language, define a set of rules for proving consequence, and prove that our set of rules is strongly sound and complete in the following sense: given a set \ of formulas, \ is a consequence of \ iff there is a proof of this fact that is based only on the rules of the system and involves only diagrams associated to \ and to the members of \. (shrink)

We consider a paradigm of applications of Logic Engineering to illustrate the information interchange among different areas of knowledge, through the formal approach to some aspects of computing. We apply the paradigm to the area of distributed systems, taking the demand for specification formalisms, treated in three areas of knowledge: modal logics, first-order logic and algebra. In doing so, we obtain transfer of intuitions and results, establishing that, as far as input/output representation is concerned, these three formalisms are equivalent.

We compare fork arrow logic, an extension of arrow logic, and its natural first-order counterpart (the correspondence language) and show that both have the same expressive power. Arrow logic is a modal logic for reasoning about arrow structures, its expressive power is limited to a bounded fragment of first-order logic. Fork arrow logic is obtained by adding to arrow logic the fork modality (related to parallelism and synchronization). As a result, fork arrow logic attains the expressive power of its first-order (...) correspondence language, so both can express the same input–output behavior of processes. (shrink)